Novel Algorithm for Composite Service Choosing
نویسندگان
چکیده
Among a variety of composite services meeting functional demands, how to make optimization choice is a difficult problem faced by users whose QoS demand is a multidimensional objective, and QoS features are not interdependent. Therefore, the service choice based on QoS aggregation is a typical multi-objective optimization problem. By analyzing the existing optimization choice algorithm for composite service based on QoS aggregation, this paper has proposed an optimization choice algorithm for composite service based on cooperative evolutionary genetic algorithm; on the basis of defining service QoS attribute feature vector, it analyzes the strategy and mechanism influencing the efficiency and solution space of this algorithm and verifies the effectiveness and feasibility of this algorithm by comparison with the experiment on traditional single-species genetic algorithm.
منابع مشابه
A Novel Fuzzy Logic Base Scheduling Mechanism for Service Differentiation in IP Networks
Quality of Service (QoS) refers to a set of rules or techniques that help the network administrators use the available network resources optimally to manage the effects of congestion and to treat the applications according to their needs. The differentiated services architecture (DiffServ) allows providing quality of service to users. The major DiffServ premise is that individual flows with sim...
متن کاملNovel Methods For Determining QoS Parameters and Thresholds in End User's Service Level Agreement
Service level agreement (SLA) is a powerful tool to formalize the negotiation and agreement between the service provider and service seeker with the scope of service quality characteristics, compensations and tariffs. The service quality description is the main part of a SLA which can be characterized by the use of suitable and feasible quality of service (QoS) parameters. Determining suitable ...
متن کاملA Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کاملA Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کاملSeparation of Aromatic and Alcoholic Mixtures using Novel MWCNT-Silica Gel Nanocomposite as an Adsorbent in Gas Chromatography
The separations of alcohols with hydrophilic and hydrophobic parts, and the separation of aromatic mixtures, are extremely important processes in gas and petroleum industries. Choosing an adsorbent for performing this separation is the most important part of the process. Silica gel is used as an adsorbent is various techniques such as pressure swing adsorption (PSA) and gas and liquid chromatog...
متن کامل